Reciprocal Tree-Like Fractal Structures

Splicing on tree-like structures

In this paper, we provide a method to accelerate the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, that is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secon...

Sympodial fractal structures: tree-inspired concept for biomimetic engineering design

In this work, the analysis of a tree-inspired fractal structure is presented. First, trajectories of points on branches of different hierarchy of a tree that oscillates freely are recorded in experiments. Then, the principle axes and ellipses of displacements are determined analytically for a sympodial fractal mechanical model. Modes of oscillations and their frequencies are found numerically f...

Dynamic Tree-like Structures in P2p-networks

The search in P2P systems is still a problem because of the dynamic nature of these systems and the lack of central catalogs. In order to improve the search in P2P systems, a sorted structure is created from the content of all nodes in the system. Different from other approaches, a tree like structure is built by tokens which are constantly moving between the nodes and carrying all structural i...

Stochastic Analysis of Tree-like Data Structures

Tree-like hierarchical associative memory structures

In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asymptotic and finite) at the expense of sparse coding. However, the original retrieval prescription performs a complete search on a fully-connected network, whereas only a small fraction of units will eventually contain d...